{"componentChunkName":"component---src-templates-post-jsx","path":"/[BOJ]1083/","result":{"data":{"site":{"siteMetadata":{"title":"SUbbb"}},"markdownRemark":{"id":"0f782160-aaa9-5c54-80c0-72a15172dd16","excerpt":"문제 BOJ - 소트 📍 Logic  가 0이 되면 종료되는 반복문  는 스왑이 가능한 범위를 의미하고, 이 범위 내의 최댓값을 찾고, 그까지 스왑을 반복한다. 범위 내의 최댓값을 찾아 그 위치를 반환한다. 📄 CODE ✏️ Review 문제 자체는 쉬웠으나, 계속  가 떠서 틀렸다. 입력 범위를 확인해보니  보다  가 클 수 있어 당연하게도 범위를 넘어가…","html":"<h2>문제</h2>\n<p><a href=\"https://www.acmicpc.net/problem/1083\">BOJ - 소트</a></p>\n<h3>📍 <strong>Logic</strong></h3>\n<deckgo-highlight-code language=\"java\" terminal=\"carbon\" theme=\"a11y-dark\" line-numbers=\"true\"  >\n          <code slot=\"code\">for (int i = 0; i &lt; N; i++) {\n    if (S == 0) break;\n\n    int maxIdx = findMax(i, i + S);\n\n    for (int j = maxIdx; j &gt; i; j--) {\n        swap(j - 1, j);\n        S--;\n    }\n}</code>\n        </deckgo-highlight-code>\n<ul>\n<li><code class=\"language-text\">S</code> 가 0이 되면 종료되는 반복문</li>\n<li><code class=\"language-text\">S</code> 는 스왑이 가능한 범위를 의미하고, 이 범위 내의 최댓값을 찾고, 그까지 스왑을 반복한다.</li>\n</ul>\n<deckgo-highlight-code language=\"java\" terminal=\"carbon\" theme=\"a11y-dark\" line-numbers=\"true\"  >\n          <code slot=\"code\">private static int findMax(int s, int e) {\n    int maxIdx = 0;\n    int max = 0;\n\n    for (int i = s; i &lt;= e &amp;&amp; i &lt; numbers.length; i++) {\n        if (max &lt; numbers[i]) {\n            maxIdx = i;\n            max = numbers[i];\n        }\n    }\n\n    return maxIdx;\n}</code>\n        </deckgo-highlight-code>\n<ul>\n<li>범위 내의 최댓값을 찾아 그 위치를 반환한다.</li>\n</ul>\n<h3>📄 <strong>CODE</strong></h3>\n<details>\n  <summary>코드 보기/접기💫</summary>\n    <div markdown=\"1\">\n<deckgo-highlight-code  terminal=\"carbon\" theme=\"a11y-dark\" line-numbers=\"true\"  >\n          <code slot=\"code\">import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.util.*;\n\npublic class Main {\n    static int[] numbers;\n    public static void main(String[] args) throws IOException {\n        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n        int N = Integer.parseInt(br.readLine());\n        numbers = Arrays.stream(br.readLine().split(&quot; &quot;)).mapToInt(Integer::parseInt).toArray();\n        int S = Integer.parseInt(br.readLine());\n\n        for (int i = 0; i &lt; N; i++) {\n            if (S == 0) break;\n\n            int maxIdx = findMax(i, i + S);\n\n            for (int j = maxIdx; j &gt; i; j--) {\n                swap(j - 1, j);\n                S--;\n            }\n        }\n\n        for (int n : numbers)\n            System.out.print(n + &quot; &quot;);\n    }\n\n    private static int findMax(int s, int e) {\n        int maxIdx = 0;\n        int max = 0;\n\n        for (int i = s; i &lt;= e &amp;&amp; i &lt; numbers.length; i++) {\n            if (max &lt; numbers[i]) {\n                maxIdx = i;\n                max = numbers[i];\n            }\n        }\n\n        return maxIdx;\n    }\n\n    private static void swap(int i1, int i2) {\n        int tmp = numbers[i1];\n        numbers[i1] = numbers[i2];\n        numbers[i2] = tmp;\n    }\n}</code>\n        </deckgo-highlight-code>\n  \t</div>\n</details>\n<h3>✏️ <strong>Review</strong></h3>\n<ul>\n<li>문제 자체는 쉬웠으나, 계속 <code class=\"language-text\">ArrayIndexOutOfBounds</code> 가 떠서 틀렸다.</li>\n<li>입력 범위를 확인해보니 <code class=\"language-text\">N</code> 보다 <code class=\"language-text\">S</code> 가 클 수 있어 당연하게도 범위를 넘어가는 경우가 발생할 수 있었다.</li>\n</ul>","frontmatter":{"title":"👩‍💻 1083. 소트","date":"May 15, 2022","update":"May 15, 2022","tags":["그리디","정렬"],"series":"👩‍💻 BOJ"},"fields":{"slug":"/[BOJ]1083/","readingTime":{"minutes":2.015}}},"seriesList":{"edges":[{"node":{"id":"27733333-3aad-5771-a1a1-27b4de4b4a01","fields":{"slug":"/[BOJ]2225/"},"frontmatter":{"title":"👩‍💻 2225. 합분해"}}},{"node":{"id":"548ba188-2afe-5575-b79f-107c6c65b07d","fields":{"slug":"/[BOJ]1012/"},"frontmatter":{"title":"👩‍💻 1012. 유기농 배추"}}},{"node":{"id":"0c712680-130f-5fa5-8c3b-3632dd5d1af0","fields":{"slug":"/[BOJ]1260/"},"frontmatter":{"title":"👩‍💻 1260. DFS와 BFS"}}},{"node":{"id":"0e07a592-06ce-5e01-b5e1-95398330372e","fields":{"slug":"/[BOJ]1707/"},"frontmatter":{"title":"👩‍💻 1707. 이분그래프"}}},{"node":{"id":"df12bfec-ed5c-5fc4-8442-0a4b3f9759a3","fields":{"slug":"/[BOJ]2668/"},"frontmatter":{"title":"👩‍💻 2668. 숫자 고르기"}}},{"node":{"id":"01bbb6dc-812c-5223-87c5-53bf04c0d0a6","fields":{"slug":"/[BOJ]9466/"},"frontmatter":{"title":"👩‍💻 9466. 텀 프로젝트"}}},{"node":{"id":"abc306b3-c3a6-552a-8979-e82d506b3921","fields":{"slug":"/[BOJ]2146/"},"frontmatter":{"title":"👩‍💻 2146. 다리 만들기"}}},{"node":{"id":"b3394e53-5e9a-595e-8da4-bb3debd220c0","fields":{"slug":"/[BOJ]5014/"},"frontmatter":{"title":"👩‍💻 5014. 스타트 링크"}}},{"node":{"id":"be297703-e778-5727-8019-6954bc95da3a","fields":{"slug":"/[BOJ]11559/"},"frontmatter":{"title":"👩‍💻 11559. Puyo Puyo"}}},{"node":{"id":"ddf11545-d468-5269-94b1-5daa2720e886","fields":{"slug":"/[BOJ]17471/"},"frontmatter":{"title":"👩‍💻 17471. 게리맨더링"}}},{"node":{"id":"8d77114d-fc6e-5de2-a3ca-c3b250425a56","fields":{"slug":"/[BOJ]2437/"},"frontmatter":{"title":"👩‍💻 2437. 저울"}}},{"node":{"id":"9a8942ce-552f-51ae-b304-0d0fab8f2eba","fields":{"slug":"/[BOJ]14891/"},"frontmatter":{"title":"👩‍💻 14891. 톱니바퀴"}}},{"node":{"id":"f1c04e8a-df0a-5294-949f-5f3a483cbcb0","fields":{"slug":"/[BOJ]14503/"},"frontmatter":{"title":"👩‍💻 14503. 로봇 청소기"}}},{"node":{"id":"883b6ecf-7528-5c16-92fa-edf12a64e80e","fields":{"slug":"/[BOJ]3190/"},"frontmatter":{"title":"👩‍💻 3190. 뱀"}}},{"node":{"id":"099b2576-7d05-5872-a9f0-f1ee6efd3a9a","fields":{"slug":"/[BOJ]14502/"},"frontmatter":{"title":"👩‍💻 14502. 연구소"}}},{"node":{"id":"50eef059-4e55-5f14-a9cf-fb01b6506f02","fields":{"slug":"/[BOJ]17779/"},"frontmatter":{"title":"👩‍💻 17779. 게리맨더링 2"}}},{"node":{"id":"aa67d90b-4801-574c-b225-56c23737a5e2","fields":{"slug":"/[BOJ]2579/"},"frontmatter":{"title":"👩‍💻 2579. 계단 오르기"}}},{"node":{"id":"9db6b43b-963a-5ebd-b72b-69936cf37858","fields":{"slug":"/[BOJ]14499/"},"frontmatter":{"title":"👩‍💻 14499. 주사위 굴리기"}}},{"node":{"id":"6a79cddd-dc1b-5e34-8a84-af313c37de0e","fields":{"slug":"/[BOJ]15685/"},"frontmatter":{"title":"👩‍💻 15685. 드래곤 커브"}}},{"node":{"id":"5e001d34-d985-545b-83ec-7f1c7caea286","fields":{"slug":"/[BOJ]17144/"},"frontmatter":{"title":"👩‍💻 17144. 미세먼지 안녕!"}}},{"node":{"id":"1d132410-9377-5e55-85b9-4664ff64de73","fields":{"slug":"/[BOJ]9935/"},"frontmatter":{"title":"👩‍💻 9935. 문자열 폭발"}}},{"node":{"id":"e13ff8d6-9b02-56c0-83e2-1d3144f70e1d","fields":{"slug":"/[BOJ]16472/"},"frontmatter":{"title":"👩‍💻 16472. 고냥이"}}},{"node":{"id":"0f782160-aaa9-5c54-80c0-72a15172dd16","fields":{"slug":"/[BOJ]1083/"},"frontmatter":{"title":"👩‍💻 1083. 소트"}}},{"node":{"id":"fef58615-9e18-5f50-8d09-3d1e2839342f","fields":{"slug":"/[BOJ]20922/"},"frontmatter":{"title":"👩‍💻 20922. 겹치는 건 싫어"}}},{"node":{"id":"7ca89240-c65f-5cb4-aeef-c5f1605ebd00","fields":{"slug":"/[BOJ]16172/"},"frontmatter":{"title":"👩‍💻 16172. 나는 친구가 적다(Large)"}}}]},"previous":{"fields":{"slug":"/[BOJ]16472/"},"frontmatter":{"title":"👩‍💻 16472. 고냥이"}},"next":{"fields":{"slug":"/[Programmers]64063/"},"frontmatter":{"title":"👩‍💻 64063. 호텔 방 배정"}}},"pageContext":{"id":"0f782160-aaa9-5c54-80c0-72a15172dd16","series":"👩‍💻 BOJ","previousPostId":"e13ff8d6-9b02-56c0-83e2-1d3144f70e1d","nextPostId":"6e98b4bf-8b00-55b8-896a-c4a7ea216c4e"}},"staticQueryHashes":[]}